|
In graph theory, a circular-arc graph is the intersection graph of a set of arcs on the circle. It has one vertex for each arc in the set, and an edge between every pair of vertices corresponding to arcs that intersect. Formally, let : be a set of arcs. Then the corresponding circular-arc graph is ''G'' = (''V'', ''E'') where : and : A family of arcs that corresponds to G is called an ''arc model''. == Recognition == demonstrated the first polynomial recognition algorithm for circular-arc graphs, which runs in time. More recently, gave the first linear time recognition algorithm. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Circular-arc graph」の詳細全文を読む スポンサード リンク
|